Critical Site Percolation in High Dimension
نویسندگان
چکیده
منابع مشابه
Percolation Dimension of Fractals
“Percolation dimension” is introduced in this note. It characterizes certain fractals and its definition is based on the Hausdorff dimension. It is shown that percolation dimension and “boundary dimension” are in a sense independent from the Hausdorff dimension and, therefore, provide an additional tool for classification of fractals. A unifying concept of fractal was introduced by Mandelbrot t...
متن کاملCritical piezoelectricity in percolation
2014 We study the behaviour of piezoelectricity in highly heterogeneous media. The piezoelectric effect introduces a coupling between electrical and mechanical properties, which have separately different scaling behaviours. Its study therefore constitutes a priori an interesting question. This problem is also suggested by the recent development of low-density, porous piezoelectric ceramics whic...
متن کاملPercolation of arbitrary words in one dimension
We consider a type of long-range percolation problem on the positive integers, motivated by earlier work of others on the appearance of (in)finite words within a site percolation model. The main issue is whether a given infinite binary word appears within an iid Bernoulli sequence at locations that satisfy certain constraints. We settle the issue in some cases, and provide partial results in ot...
متن کاملCritical Phenomena in Percolation Theory
In this paper, the critical behavior of the percolation models is reviewed, with emphasis on the scaling laws present and its relationship with other simple models like the Ising magnet. A liitle bit of the history and some examples of its application are given to illustrate the range of phenomena that can be described with such models.
متن کاملNumerical evaluation of the upper critical dimension of percolation in scale-free networks.
We propose numerical methods to evaluate the upper critical dimension d(c) of random percolation clusters in Erdös-Rényi networks and in scale-free networks with degree distribution P(k) approximately k(-lambda), where k is the degree of a node and lambda is the broadness of the degree distribution. Our results support the theoretical prediction, d(c) = 2(lambda - 1)(lambda - 3) for scale-free ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Physics
سال: 2020
ISSN: 0022-4715,1572-9613
DOI: 10.1007/s10955-020-02607-y